A Hierarchy of Techniques for Simplifying Polygonal Models

نویسنده

  • Amitabh Varshney
چکیده

It is evident from these course notes and their references that there is a tremendous interest in the general area of simplification of polygonal objects. There are several ways in which one can classify the various simplification techniques. One of these is by examining the nature of the performed simplifications. This section of the course will overview some representative techniques from a hierarchy of increasingly aggressive simplification techniques. In Section 2 we overview a popular approach to compress the connectivity information for polygonal objects – by using triangle strips. Section 3 overviews Simplification Envelopes and their features. In Section 4 we overview some of our research in simplifying the genus of an object. Constructing a multiresolution hierarchy is only part of the solution in a level-of-detail-based rendering scheme. Switching levels of detail among different objects and at different regions within the same object is quite important for view-dependent level-of-detail rendering and is discussed in Section 5. Section 6 concludes this part of the course by overviewing some of our experiences in writing software for simplification of real-life objects.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deformation Sensitive Decimation

In computer graphics, many automatic methods for simplifying polygonal meshes have been developed. These techniques work very well for static meshes; however, they do not handle the case of deforming objects. Simplifying any single pose of a deforming object may destroy detail required to represent the shape in a different pose. We present an automatic technique for simplifying deforming charac...

متن کامل

Organization and Simplification of High-Resolution 3D City Facades

This paper describes an approach for the organization and simplification of high-resolution geometry and imagery data for 3D buildings for interactive city navigation. At the highest level of organization, building data are inserted into a global hierarchy that supports the large-scale storage of cities around the world. This structure also provides fast access to the data suitable for interact...

متن کامل

Simplifying spline models

We present a new approach for simplifying models composed of spline patches. Given an input model, the algorithm computes a new approximation of the model in terms of cubic triangular B ezier patches. It performs a series of geometric operations, consisting of patch merging and swapping diagonals, and makes use of patch connectivity information to generate C-LODs (curved levelsof-detail). Each ...

متن کامل

Locating of planting project using Analytic Hierarchy Process and Fuzzy logic (case study: Maravehtappe watershed, Golestan province)

Planting project is one of the methods for improvement of rangeland degradation that exact implementation depends on many factors. Therefore, there is a need for a fundamental method. In the present study for locating planting project, in Maravehtappe watershed, analytic hierarchical process and fuzzy logic are applied. In this study, four ecological criteria of vegetation, soil, physiography a...

متن کامل

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

A well-known measure to characterize the similarity of two polygonal chains is the famous Fréchet distance. In this paper, for the first time, we consider the problem of simplifying 3D polygonal chains under the discrete Fréchet distance. We present efficient polynomial time algorithms for simplifying a single chain, including the first near-linear O(n log n) time exact algorithm for the contin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997